A note on converging geometric-type processes

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Converging Geometric-type Processes

The process of deterioration of repairable systems with each repair is modeled using converging geometric-type processes. It is proved that the expectation of the number of repairs in each interval of time is infinite. A new regularization procedure is suggested and the corresponding optimization problem is discussed.

متن کامل

A Note on a Family of Newton Type Iterative Processes

In this paper, we study the convergence of a family of iteration methods to solve nonlinear equations in the complex plane. Two analysis of convergence are provided. We give a Kantorovich-type convergence theorem under mild differentiability conditions with error analysis.

متن کامل

A note on the Young type inequalities

In this   paper,  we   present  some  refinements  of the   famous Young  type  inequality.   As  application  of   our   result, we  obtain  some  matrix inequalities   for   the  Hilbert-Schmidt norm  and   the  trace   norm. The results    obtained   in  this  paper  can  be   viewed   as  refinement  of  the   derived  results   by  H.  Kai  [Young  type  inequalities  for matrices,  J.  Ea...

متن کامل

A note on computing matrix geometric means

A new definition is introduced for the matrix geometric mean of a set of k positive definite n×n matrices together with an iterative method for its computation. The iterative method is locally convergent with cubic convergence and requires O(n3k2) arithmetic operations per step whereas the methods based on the symmetrization technique of Ando, Li and Mathias [Linear Algebra Appl., 385 (2004), p...

متن کامل

A note on light geometric graphs

Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G has the property that each of the two open half-planes bounded by the line through e contains more than k edges of G. We extend the previous result in [1] and with a shorter argument show that every k-light geometric graph on n vertices has at most O(n √ k) edges. This bound is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Probability

سال: 2010

ISSN: 0021-9002,1475-6072

DOI: 10.1017/s0021900200006859